A Method to Reduce the Key Size of UOV Signature Scheme

Multivariate public key signature scheme has a good performance on speed and signature size. But most of them have a huge public key size. In this paper, we propose a new method to reduce the public key size of unbalance oil and vinegar (UOV) signature scheme. We can reduce the public key size of UOV scheme to about 4KB for 128 bits security level. This method can be used to reduce the public key sizes of other multivariate public key cryptosystems

Improved Key Recovery of the HFEv- Signature Scheme

The HFEv- signature scheme is a twenty year old multivariate public key signature scheme. It uses the Minus and the Vinegar modifier on the original HFE scheme. An instance of the HFEv- signature scheme called GeMSS is one of the alternative candidates for signature schemes in the third round of the NIST Post Quantum Crypto (PQC) Standardization Project. In this paper, we propose a new key recovery attack on the HFEv- signature scheme. We show that the Minus modification does not enhance the security of cryptosystems of the HFE family, while the Vinegar modification increases the complexity of our attack only by a polynomial factor. By doing so, we show that the proposed parameters of the GeMSS scheme are not as secure as claimed. Our attack shows that it is very difficult to build a secure and efficient signature scheme on the basis of HFEv-

Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction

Post-quantum cryptography now plays a central role in cryptography. Many candidates of post-quantum cryptosystems (PQC) have been already proposed but require public keys of large sizes. Constructing PQC with public keys of small sizes is strongly desired. In [Oku15], Okumura proposed a public key cryptosystem based on the difficulty of solving Diophantine equations of degree increasing type (DEC for short). DEC is proposed as an analogue of the Algebraic Surface Cryptosystem [AGM09]. DEC has been expected to avoid the analogues of all attacks against ASC (and the previous versions of ASC). Moreover, DEC has been expected to be a candidate of PQC and to achieve the high security with public keys of small sizes, e.g., about 1;200 bits with 128 bit security. In this paper, we propose a polynomial time attack against DEC. We show that the security of DEC depends on the difficulty of finding special (relatively) short vectors in some lattices obtained from a public key and a ciphertext. The most important target vector in our attack is not necessarily a shortest vector in a lattice of low rank but only some entries are relatively small. In our attack, the LLL algorithm with respect to well-known norms such as the $p$-norms ($1 \leq p \leq 1$) does not seem to work well for finding such vectors. The most technical point of our method is to heuristically find a special norm, which we call a weighted norm, such that the most important target vector becomes a (nearly) shortest vector in a lattice of low rank. We call the LLL algorithm with respect to a weighted norm the ``weighted LLL algorithm in this paper. Our experimental results by a standard PC with Magma suggest that our attack via the weighted LLL algorithm can break the one-wayness of DEC for 128 bit security proposed in [Oku15] with sufficiently high probability

Genome-Wide Association Study of Tacrolimus Pharmacokinetics Identifies Novel Single Nucleotide Polymorphisms in the Convalescence and Stabilization Periods of Post-transplant Liver Function

After liver transplantation, the liver function of a patient is gradually restored over a period of time that can be divided into a convalescence period (CP) and a stabilizing period (SP). The plasma concentration of tacrolimus, an immunosuppressant commonly used to prevent organ rejection, varies as a result of variations in its metabolism. The effects of genetic and clinical factors on the plasma concentration of tacrolimus appear to differ in the CP and SP. To establish a model explaining the variation in tacrolimus trough concentration between individuals in the CP and SP, we conducted a retrospective, single-center, discovery study of 115 pairs of patients (115 donors and 115 matched recipients) who had undergone liver transplantation. Donors and recipients were genotyped by a genome-wide association study (GWAS) using an exome chip. Novel exons were identified that influenced tacrolimus trough concentrations and were verified with bootstrap analysis. In donors, two single-nucleotide polymorphisms showed an effect on the CP (rs1927321, rs1057192) and four showed an effect on the SP (rs776746, rs2667662, rs7980521, rs4903096); in recipients, two single-nucleotide polymorphisms showed an effect in the SP (rs7828796, rs776746). Genetic factors played a crucial role in tacrolimus metabolism, accounting for 44.8% in the SP, which was higher than previously reported. In addition, we found that CYP3A5, which is known to affect the metabolism of tacrolimus, only influenced tacrolimus pharmacokinetics in the SP

Precision Higgs physics at the CEPC

The discovery of the Higgs boson with its mass around 125 GeV by the ATLAS and CMS Collaborations marked the beginning of a new era in high energy physics. The Higgs boson will be the subject of extensive studies of the ongoing LHC program. At the same time, lepton collider based Higgs factories have been proposed as a possible next step beyond the LHC, with its main goal to precisely measure the properties of the Higgs boson and probe potential new physics associated with the Higgs boson. The Circular Electron Positron Collider~(CEPC) is one of such proposed Higgs factories. The CEPC is an $e^+e^-$ circular collider proposed by and to be hosted in China. Located in a tunnel of approximately 100~km in circumference, it will operate at a center-of-mass energy of 240~GeV as the Higgs factory. In this paper, we present the first estimates on the precision of the Higgs boson property measurements achievable at the CEPC and discuss implications of these measurements.Comment: 46 pages, 37 figure

A New Algorithm for Solving the General Approximate Common Divisors Problem and Cryptanalysis of the FHE Based on the GACD problem

Abstract. In this paper, we propose a new algorithm for solving the general approximate common divisors (GACD) problems, which is based on lattice reduction algorithms on certain special lattices and linear equation solving algorithms over integers. Through both theoretical arguments and experimental data, we show that our new algorithm works in polynomial time but under roughly the following condition: – There is a positive integer t such that γ + η t + + ρ < η; t H – We have more than t GACD samples. or equivalently H(η − ρ) 2 − 4(γ + η)> 0 – We have more than t = ⌈ H(η−ρ)− H2 (η−ρ) 2−4H(γ+η) ⌉ GACD samples

Pricing Decision of Three-Level Agricultural Supply Chain Based on Blockchain Traceability and Altruistic Preference

The traceability of blockchain is crucial to the quality and safety of agricultural products, primarily when bacterial contamination occurs in the agricultural supply chain. To gain a deeper understanding of the impacts on the quality and safety of agricultural products, we built a three-level agricultural supply chain model comprising one retailer, one manufacturer, and one supplier. We aimed to explore the impact of blockchain traceability and retailers’ altruistic preference on pricing decisions and channel member profit, and to then examine the motivation of enterprises to participate in blockchain technology. Our study showed that: (1) blockchain technology has the potential to improve the prices and profits of supply chain members without considering the cost of blockchain; and (2) blockchain technology has the potential to improve the retailer’s price when the unit variable cost of blockchain is higher than a certain threshold. It can also reduce the manufacturer’s price and the supplier’s output. However, the excessive cost of blockchain can also aggravate the double marginalization effect of the supply chain. When both the unit variable cost and the fixed input cost of the blockchain are low, each enterprise has the incentive to participate in the blockchain. (3) In the scenario of the altruistically-preferred retailer, when the blockchain variable cost is lower than a certain threshold, the retailer’s altruistic preferences can improve the manufacturer’s and supplier’s profit, but it will reduce the retailer’s profit